21![An Efficient Algorithm for Euclidian 2-Center with Outliers∗ Pankaj K. Agarwal† Jeff M. Phillips‡ Abstract An Efficient Algorithm for Euclidian 2-Center with Outliers∗ Pankaj K. Agarwal† Jeff M. Phillips‡ Abstract](https://www.pdfsearch.io/img/347401cb8b24ee5e87b3ebcd5f8a3c47.jpg) | Add to Reading ListSource URL: www.cs.duke.eduLanguage: English - Date: 2011-04-05 22:51:11
|
---|
22![Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a](https://www.pdfsearch.io/img/874267af64a062d534ab80bbcf96f68f.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2009-09-24 16:12:25
|
---|
23![Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge† Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†](https://www.pdfsearch.io/img/35f6fb52e4a58be939632d806ab4658d.jpg) | Add to Reading ListSource URL: www.cs.swarthmore.eduLanguage: English - Date: 2003-09-17 11:15:54
|
---|
24![An Improved Algorithm for Computing the Volume of the Union of Cubes ∗ Pankaj K. Agarwal Department of Computer Science An Improved Algorithm for Computing the Volume of the Union of Cubes ∗ Pankaj K. Agarwal Department of Computer Science](https://www.pdfsearch.io/img/2c8950f6b73d21ff992d49468c705d48.jpg) | Add to Reading ListSource URL: www.cs.duke.eduLanguage: English - Date: 2011-05-25 21:09:39
|
---|
25![A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two](https://www.pdfsearch.io/img/3f0aa7757188e58ad34d835fa82f3e05.jpg) | Add to Reading ListSource URL: www.cs.utah.eduLanguage: English - Date: 2013-06-30 22:33:39
|
---|
26![On Polyhedra Induced by Point Sets in Space Pankaj K. Agarwal Ferran Hurtado On Polyhedra Induced by Point Sets in Space Pankaj K. Agarwal Ferran Hurtado](https://www.pdfsearch.io/img/3ebb913f404d16ed0b491c399507d1a2.jpg) | Add to Reading ListSource URL: www.cs.duke.eduLanguage: English - Date: 2011-04-05 22:51:26
|
---|
27![Computational Geometry–127 Cylindrical static and kinetic binary space partitions Pankaj K. Agarwal a,∗,1 , Leonidas J. Guibas b,2 , T.M. Murali c,3 , Jeffrey Scott Vitter a,4 a Center for Geometric Co Computational Geometry–127 Cylindrical static and kinetic binary space partitions Pankaj K. Agarwal a,∗,1 , Leonidas J. Guibas b,2 , T.M. Murali c,3 , Jeffrey Scott Vitter a,4 a Center for Geometric Co](https://www.pdfsearch.io/img/7cd1a05a1f63e7950cea906533cfa2d4.jpg) | Add to Reading ListSource URL: www.cs.duke.edu- Date: 2011-04-05 22:51:19
|
---|
28![CPS296.2 Geometric Optimization February 27, 2007 Lecture 14: k-center Problem Lecturer: Pankaj K. Agarwal CPS296.2 Geometric Optimization February 27, 2007 Lecture 14: k-center Problem Lecturer: Pankaj K. Agarwal](https://www.pdfsearch.io/img/2c9c965ee9f9cbcec832831c9ae59bf9.jpg) | Add to Reading ListSource URL: www.cs.duke.edu- Date: 2007-04-18 18:12:01
|
---|
29![Robust Shape Fitting via Peeling and Grating Coresets∗ Pankaj K. Agarwal† Sariel Har-Peled‡ Hai Yu§ Robust Shape Fitting via Peeling and Grating Coresets∗ Pankaj K. Agarwal† Sariel Har-Peled‡ Hai Yu§](https://www.pdfsearch.io/img/a547d14e5fb4f77b043f44111b79091a.jpg) | Add to Reading ListSource URL: www.cs.duke.edu- Date: 2007-03-20 12:30:36
|
---|
30![A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?∗ Pankaj K. Agarwal† ABSTRACT In the Euclidean bipartite matching problem, we are given a set R A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?∗ Pankaj K. Agarwal† ABSTRACT In the Euclidean bipartite matching problem, we are given a set R](https://www.pdfsearch.io/img/f5ef1b117dae02d977891b5b3786a583.jpg) | Add to Reading ListSource URL: www.cs.duke.edu- Date: 2011-04-05 22:51:12
|
---|